Minima hopping guided path search: an efficient method for finding complex chemical reaction pathways.

نویسندگان

  • Bastian Schaefer
  • Stephan Mohr
  • Maximilian Amsler
  • Stefan Goedecker
چکیده

The Minima Hopping global optimization method uses physically realizable molecular dynamics moves in combination with an energy feedback that guarantees the escape from any potential energy funnel. For the purpose of finding reaction pathways, we argue that Minima Hopping is particularly suitable as a guide through the potential energy landscape and as a generator for pairs of minima that can be used as input structures for methods capable of finding transition states between two minima. For Lennard-Jones benchmark systems we compared this Minima Hopping guided path search method to a known approach for the exploration of potential energy landscapes that is based on deterministic mode-following. Although we used a stabilized mode-following technique that reliably allows to follow distinct directions when escaping from a local minimum, we observed that Minima Hopping guided path search is far superior in finding lowest-barrier reaction pathways. We, therefore, suggest that Minima Hopping guided path search can be used as a simple and efficient way to identify energetically low-lying chemical reaction pathways. Finally, we applied the Minima Hopping guided path search approach to 75-atom and 102-atom Lennard-Jones systems. For the 75-atom system we found pathways whose highest energies are significantly lower than the highest energy along the previously published lowest-barrier pathway. Furthermore, many of these pathways contain a smaller number of intermediate transition states than the previously publish lowest-barrier pathway. In case of the 102-atom system Minima Hopping guided path search found a previously unknown and energetically low-lying funnel.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)

One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...

متن کامل

Minima hopping: an efficient search method for the global minimum of the potential energy surface of complex molecular systems.

A method is presented that can find the global minimum of very complex condensed matter systems. It is based on the simple principle of exploring the configurational space as fast as possible and of avoiding revisiting known parts of this space. Even though it is not a genetic algorithm, it is not based on thermodynamics. The efficiency of the method depends strongly on the type of moves that a...

متن کامل

Performance enhancement of a time hopping - pulse position modulation ultra-wide-band system using guided local search

In this study, the authors propose a method to minimise the multi-user interference (MUI) caused by multiple access (MA) in a time hopping ultra-wide-band (TH-UWB) system with line-of-sight (LOS) multi-path channel in a residential environment IEEE 802.15.4a channel model. The authors considered both synchronous and asynchronous cases. The problem is formulated as a combinatorial optimisation p...

متن کامل

Efficient moves for global geometry optimization methods and their application to binary systems.

We show that molecular dynamics based moves in the minima hopping method are more efficient than saddle point crossing moves. For binary systems we incorporate identity exchange moves in a way that allows one to avoid the generation of high energy configurations. Using this modified minima hopping method, we re-examine the binary Lennard-Jones benchmark system with up to 100 atoms and we find a...

متن کامل

Multicanonical basin hopping: a new global optimization method for complex systems.

We introduce a new optimization algorithm that combines the basin-hopping method, which can be used to efficiently map out an energy landscape associated with minima, with the multicanonical Monte Carlo method, which encourages the system to move out of energy traps during the computation. As an example of implementing the algorithm for the global minimization of a multivariable system, we cons...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • The Journal of chemical physics

دوره 140 21  شماره 

صفحات  -

تاریخ انتشار 2014